A fully abstract denotational semantics for the π-calculus
نویسندگان
چکیده
منابع مشابه
A Denotational Semantics for the π-Calculus
In his categorical framework, Stark defines a domain-theoretic model for the π-calculus based on functor categories. Despite being a sound abstract model, a more concrete semantics is required if it is to be used as a basis for proving properties about mobile systems. In this paper, we concretize Stark’s denotational model for the π-calculus and provide a full definition of the semantic domains...
متن کاملA fully abstract semantics for causality in the π - calculus ∗
We examine the meaning of causality in calculi for mobile processes like the π-calculus, and we investigate the relationship between interleaving and causal semantics for such calculi. We separate two forms of causal dependencies on actions of π-calculus processes, called subject and object dependencies: The former originate from the nesting of prefixes and are propagated through interactions a...
متن کاملFully abstract semantics of λμ in the π-calculus
We study the λμ-calculus, extended with explicit substitution, and study a logic-based compositional output-based translation into a variant of the π-calculus with pairing that preserves single-step explicit head reduction with respect to contextual equivalence. We will define two notions of equality for λμ, modelling explicit head-reduction, head reduction, and show they coincide. We define fo...
متن کاملOutline of a Denotational Semantics for the π-Calculus
It appears possible to give a fairly standard denotational semantics for the π-calculus, provided that we work within a functor category indexed by a category I of finite sets and injections. The construction is driven by the expansion law, and resembles Abramsky’s domain of synchronisation trees [1]. It also extends Ingólfsdóttir’s work on domain models of value-passing CCS [4]. The relevant p...
متن کاملA fully abstract denotational semantics for the calculus of higher-order communicating systems
In this paper we study the Calculus of Higher Order Communicating Systems (CHOCS) (Thomsen, Proc. of POPL’89, ACM, 1989, pp. 143–154; Inform. Comput. 116(1) (1995) 38–57) in a denotational setting. We present a construction of a denotational semantics for CHOCS which resides in a domain constructed using the standard constructions of separated sum, Cartesian product, the Plotkin power domain co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2002
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(00)00331-5